Krylov Projection Methodsfor Model
نویسندگان
چکیده
This dissertation focuses on e ciently forming reduced-order models for large, linear dynamic systems. Projections onto unions of Krylov subspaces lead to a class of reducedorder models known as rational interpolants. The cornerstone of this dissertation is a collection of theory relating Krylov projection to rational interpolation. Based on this theoretical framework, three algorithms for model reduction are proposed. The rst algorithm, dual rational Arnoldi, is a numerically reliable approach involving orthogonal projection matrices. The second, rational Lanczos, is an e cient generalization of existing Lanczos-based methods. The third, rational power Krylov, avoids orthogonalization and is suited for parallel or approximate computations. The performance of the three algorithms is compared via a combination of theory and examples. Independent of the precise algorithm, a host of supporting tools are also developed to form a complete model-reduction package. Techniques for choosing the matching frequencies, estimating the modeling error, insuring the model's stability, treating multiple-inputmultiple-output systems, implementing parallelism, and avoiding a need for exact factors of large matrix pencils are all examined to various degrees. iii DEDICATION To my wife, Kimberly. iv ACKNOWLEDGMENTS I would like to thank all those who supported me throughout my doctoral studies. Foremost on this list are my advisors, Professors Kyle Gallivan and Paul Van Dooren. Paul deserves the credit for starting me on my work in numerical linear algebra. His insights showed me what an interesting eld it can be. Many thanks go to Kyle for his support through the latter years of my doctoral research. His encouragement and humor are much appreciated. I also thank Drs. Danny Sorensen, Steve Ashby and Eli Chiprout for working with me at di erent times over the past three years. Each was an excellent host who contributed signi cantly to my education. Danny played a key role in my introduction to iterative Krylov methods. Steve pointed me in the direction of Davidson's method, an approach that implicitly touches many parts of this dissertation. Eli patiently led me through the basics of circuit analysis and asked many stimulating questions. My gratitude also goes out to my examination committee, Professors Bassam Bamieh, Farid Najm and M. Pai, for their time and comments. Professors Bamieh and Najm also deserve thanks for providing hours of classroom instruction. Finally, I thank the Department of Energy for its nancial support. This dissertation was supported in part by the Computational Science Graduate Fellowship Program of the O ce of Scienti c Computing in the Department of Energy. v TABLE OF CONTENTS CHAPTER PAGE
منابع مشابه
The Krylov - Bogoliubov and Galerkin Methodsfor
1 P. YU ET AL. KB AND GALERKIN METHODS 2 SUMMARY The objective of this paper is to consider the dynamic motions of second order, weakly nonlinear, discrete systems. The main attention is focused on a comparison, for such systems, of the method of Krylov-Bogoliubov (KB) and an enhanced Galerkin (EG) method which produce seemingly diierent solutions. Despite the apparent diierences, the two metho...
متن کاملKrylov projection framework for Fourier model reduction
This paper analyzes the Fourier model reduction (FMR) method from a rational Krylov projection framework and shows how the FMR reduced model, which has guaranteed stability and a global error bound, can be computed in a numerically efficient and robust manner. By monitoring the rank of the Krylov subspace that underlies the FMR model, the projection framework also provides an improved criterion...
متن کاملModel Reduction for Time-Varying Descriptor Systems Using Krylov-Subspaces Projection Techniques
We will present a projection approach for model reduction of linear time-varying descriptor systems based on earlier ideas in the work of Philips and others. The idea behind the proposed procedure is based on a multipoint rational approximation of the monodromy matrix of the corresponding differential-algebraic equation. This is realized by orthogonal projection onto a rational Krylov subspace....
متن کاملProjection-Based Model Reduction for Time-Varying Descriptor Systems Using Recycled Krylov Subspaces
We will present a projection approach for model reduction of linear time-varying descriptor systems based on earlier ideas in the work of Philips and others. The idea behind the proposed procedure is based on a multipoint rational approximation of the monodromy matrix of the corresponding differential-algebraic equation. This is realized by orthogonal projection onto a rational Krylov subspace....
متن کاملIntroduction to Krylov Subspace Methods in Model Order Reduction
In recent years, Krylov subspace methods have become popular tools for computing reduced order models of high order linear time invariant systems. The reduction can be done by applying a projection from high order to lower order space using the bases of some subspaces called input and output Krylov subspaces. The aim of this paper is to give an introduction into the principles of Krylov subspac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997